Kernelization of the 3-path vertex cover problem
نویسندگان
چکیده
منابع مشابه
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. In this paper, we give a kernel of 5k vertices and an O(1.7485)-time polynomial-space algorithm for this problem, both new results improve previous known b...
متن کاملKernelization as Heuristic Structure for the Vertex Cover Problem
For solving combinatorial optimisation problems, exactmethods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation or heuristic methods are tractable for very large problems butmay possibly be led into a bad solution. A question that arises is, From where can we obtain knowledge of the problem structure via exact methods that can be exploite...
متن کاملKernelization Algorithms for the Vertex Cover Problem: Theory and Experiments
A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. A new technique, termed crown reduction, is introduced and analyzed. Applications to computational biology are discussed.
متن کاملPropagation via Kernelization: The Vertex Cover Constraint
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient parameterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators thro...
متن کاملSmaller Parameters for Vertex Cover Kernelization
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str{\o}mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a vertex set such that each connected component of $G-X$ contains at most one cycle, i.e., $X$ is a modulator to a pseudoforest. We strongly generalize this re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.12.006